منابع مشابه
On the Alekhnovich–Razborov degree lower bound
Polynomial calculus is a Hilbert-style proof system in which lines are polynomials modulo x = x (for each variable x) and the rules allow deriving c1P1 + c2P2 from P1, P2 and xP from P for a variable x. A polynomial calculus refutation of a set of axioms is a derivation of 1 from these axioms. Research in proof complexity tends to concentrate on the length of proofs. We will rather be intereste...
متن کاملLower Bound on Weights of Large Degree Threshold Functions
An integer polynomial p of n variables is called a threshold gate for a Boolean function f of n variables if for all x ∈ {0, 1} f(x) = 1 if and only if p(x) > 0. The weight of a threshold gate is the sum of its absolute values. In this paper we study how large a weight might be needed if we fix some function and some threshold degree. We prove 2 ) lower bound on this value. The best previous bo...
متن کاملIndependent Sets near the Lower Bound in Bounded Degree Graphs
By Brook’s Theorem, every n-vertex graph of maximum degree at most ∆ ≥ 3 and clique number at most ∆ is ∆-colorable, and thus it has an independent set of size at least n/∆. We give an approximate characterization of graphs with independence number close to this bound, and use it to show that the problem of deciding whether such a graph has an indepdendent set of size at least n/∆ + k has a ker...
متن کاملLower bound techniques for data structures
We describe new techniques for proving lower bounds on data-structure problems, with the following broad consequences: • the first Ω(lg n) lower bound for any dynamic problem, improving on a bound that had been standing since 1989; • for static data structures, the first separation between linear and polynomial space. Specifically, for some problems that have constant query time when polynomial...
متن کاملNew Upper Bound and Lower Bound for Degree-Based Network Entropy
The degree-based network entropy which is inspired by Shannon’s entropy concept becomes the information-theoretic quantity for measuring the structural information of graphs and complex networks. In this paper, we study some properties of the degree-based network entropy. Firstly we develop a refinement of Jensen’s inequality. Next we present the new and more accurate upper bound and lower boun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2020
ISSN: 1064-8275,1095-7197
DOI: 10.1137/18m1194481